System paper for CoNLL-2012 shared task: Hybrid Rule-based Algorithm for Coreference Resolution
نویسندگان
چکیده
This paper describes our coreference resolution system for the CoNLL-2012 shared task. Our system is based on the Stanford’s dcoref deterministic system which applies multiple sieves with the order from high precision to low precision to generate coreference chains. We introduce the newly added constraints and sieves and discuss the improvement on the original system. We evaluate the system using OntoNotes data set and report our results of average F-score 58.25 in the closed track.
منابع مشابه
Combining the Best of Two Worlds: A Hybrid Approach to Multilingual Coreference Resolution
We describe our system for the CoNLL-2012 shared task, which seeks to model coreference in OntoNotes for English, Chinese, and Arabic. We adopt a hybrid approach to coreference resolution, which combines the strengths of rule-based methods and learningbased methods. Our official combined score over all three languages is 56.35. In particular, our score on the Chinese test set is the best among ...
متن کاملRule and Tree Ensembles for Unrestricted Coreference Resolution
In this paper, we describe a machine learning system based on rule and tree ensembles for unrestricted coreference resolution. We use Entropy Guided Transformation Learning (ETL) and Decision Trees as the base learners, and, respectively, ETL Committee and Random Forest as ensemble algorithms. Our system is evaluated on the closed track of the CoNLL 2011 shared task: Modeling Unrestricted Coref...
متن کاملCorpus based coreference resolution for Farsi text
"Coreference resolution" or "finding all expressions that refer to the same entity" in a text, is one of the important requirements in natural language processing. Two words are coreference when both refer to a single entity in the text or the real world. So the main task of coreference resolution systems is to identify terms that refer to a unique entity. A coreference resolution tool could be...
متن کاملData-driven Multilingual Coreference Resolution using Resolver Stacking
This paper describes our contribution to the CoNLL 2012 Shared Task.1 We present a novel decoding algorithm for coreference resolution which is combined with a standard pair-wise coreference resolver in a stacking approach. The stacked decoders are evaluated on the three languages of the Shared Task. We obtain an official overall score of 58.25 which is the second highest in the Shared Task.
متن کاملIncorporating Rule-based and Statistic-based Techniques for Coreference Resolution
This paper describes a coreference resolution system for CONLL 2012 shared task developed by HLT_HITSZ group, which incorporates rule-based and statistic-based techniques. The system performs coreference resolution through the mention pair classification and linking. For each detected mention pairs in the text, a Decision Tree (DT) based binary classifier is applied to determine whether they fo...
متن کامل